An approximate dynamic programming approach for collaborative caching
نویسندگان
چکیده
منابع مشابه
An approximate dynamic programming approach to solving dynamic oligopoly models
In this paper we introduce a new method to approximate Markov perfect equilibrium in large scale Ericson and Pakes (1995)-style dynamic oligopoly models that are not amenable to exact solution due to the curse of dimensionality. The method is based on an algorithm that iterates an approximate best response operator using an approximate dynamic programming approach based on linear programming. W...
متن کاملAn Approximate Dynamic Programming Approach for a Product Distribution Problem
This paper proposes an approximate dynamic programming-based method for optimizing the distribution operations of a company manufacturing a certain product in numerous plants and distributing it to different regional markets for sale. The production at each plant and in each time period follows a nonstationary stochastic process. The product can be stored at the plants or shipped to a regional ...
متن کاملA Collaborative Approach for Caching Dynamic Data in Portal Applications
Portals are one of the rapidly growing applications on the Web, providing a single interface to access different sources (providers). Providing fast response time is one of the critical issues in such applications. Dissatisfaction of users dramatically increases with increasing response time, resulting in abandonment of Web sites, which in turn could result in loss of revenue by businesses. In ...
متن کاملAn Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
We present an Approximate Dynamic Programming (ADP) approach for the multidimensional knapsack problem (MKP). We approximate the value function (a) using parametric and nonparametric methods and (b) using a base-heuristic. We propose a new heuristic which adaptively rounds the solution of the linear programming relaxation. Our computational study suggests: (a) the new heuristic produces high qu...
متن کاملPortfolio Optimization with Position Constraints: an Approximate Dynamic Programming Approach
We analyze dynamic portfolio choice problems using an approximate dynamic programming (ADP) algorithm. We extend the algorithm to the case of constraints on borrowing and implement a duality-based simulation procedure for estimating bounds on the true value function. We demonstrate that the ADP solution exhibits a high degree of accuracy in the considered examples, indicating that this is a pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Optimization
سال: 2020
ISSN: 0305-215X,1029-0273
DOI: 10.1080/0305215x.2020.1767098